A Comparative Agglomerative Hierarchical Clustering Method to Cluster Implemented Course

نویسندگان

  • Rahmat Widia Sembiring
  • Jasni Mohamad Zain
  • Abdullah Embong
چکیده

There are many clustering methods, such as hierarchical clustering method. Most of the approaches to the clustering of variables encountered in the literature are of hierarchical type. The great majority of hierarchical approaches to the clustering of variables are of agglomerative nature. The agglomerative hierarchical approach to clustering starts with each observation as its own cluster and then continually groups the observations into increasingly larger groups. Higher Learning Institution (HLI) provides training to introduce final-year students to the real working environment. In this research will use Euclidean single linkage and complete linkage. MATLAB and HCE 3.5 software will used to train data and cluster course implemented during industrial training. This study indicates that different method will create a different number of clusters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

UNED PanMorCrepsTeam at M-WePNaD

This paper describes the participation of the PanMorCresp team in the Multilingual Web Person Name Disambiguation task of IberEval 2017. The solutions consisted of different variants of the traditional hierarchical agglomerative clustering algorithm. The four approaches have been defined and implemented independently by three Master’s students over the same vocabulary generation software. The p...

متن کامل

Hybrid Hierarchical Clustering: an Experimental Analysis

In this paper, we present a hybrid clustering method that combines the divisive hierarchical clustering with the agglomerative hierarchical clustering. We used the bisect K-means divisive clustering algorithm in our method. First, we cluster the document collection using bisect K-means clustering algorithm with K’ > K as the total number of clusters. Second, we calculate the centroids of K’ clu...

متن کامل

Clustering based on Dissimilarity First Derivatives

A hierarchical agglomerative clustering algorithm based on the analysis of dissimilarity increments between neighboring patterns is presented. The first derivative of dissimilarity between neighboring patterns inside a natural cluster is modelled by an exponential distribution, this statistic characterizing the cluster. A cluster isolation criterion is defined based on estimates of each cluster...

متن کامل

Agglomerative Hierarchical Clustering using AVL tree in the case of single-linkage clustering method

The hierarchy is often used to infer knowledge from groups of items and relations in varying granularities. Hierarchical clustering algorithms take an input of pairwise data-item similarities and output a hierarchy of the data-items. This paper presents Bidirectional agglomerative hierarchical clustering to create a hierarchy bottom-up, by iteratively merging the closest pair of data-items into...

متن کامل

Divisive Hierarchical Clustering with K-means and Agglomerative Hierarchical Clustering

To implement divisive hierarchical clustering algorithm with K-means and to apply Agglomerative Hierarchical Clustering on the resultant data in data mining where efficient and accurate result. In Hierarchical Clustering by finding the initial k centroids in a fixed manner instead of randomly choosing them. In which k centroids are chosen by dividing the one dimensional data of a particular clu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1101.4270  شماره 

صفحات  -

تاریخ انتشار 2010